Extended formulations for the cardinality constrained subtree of a tree problem
نویسندگان
چکیده
We consider the problem of finding the most profitable subtree of a given tree with at most K nodes which is known as the Cardinality Subtree of a Tree Problem (CSTP). We present a new extended formulation with O(nK) two-indexed variables and O(nK) constraints. Each variable contains information on node inclusion as well as the order by which the node is included in the subtree solution. We show that the corresponding linear programming relaxation has integral extreme points.
منابع مشابه
Kaikoura Information Processing Letters tree theorems : Computing the maximum agreement subtree
The Maximum Agreement Subtree Problem was posed by Finden and Gordon in 1985, and is as follows: given a set S={s,, sz,..., s,,} and two trees P and Q leaf-labelled by the elements of S, find a maximum cardinality subset S, of S such that PI S, = Q IS,. This problem arises in evolutionary tree construction, where different methods or data yield (possibly) different trees for the same species on...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملAn efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملStock Portfolio-Optimization Model by Mean-Semi-Variance Approach Using of Firefly Algorithm and Imperialist Competitive Algorithm
Selecting approaches with appropriate accuracy and suitable speed for the purpose of making decision is one of the managers’ challenges. Also investing decision is one of the main decisions of managers and it can be referred to securities transaction in financial markets which is one of the investments approaches. When some assets and barriers of real world have been considered, optimization of...
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 37 شماره
صفحات -
تاریخ انتشار 2009